Quasi-Monte Carlo: halftoning in high dimensions?
نویسنده
چکیده
The goal in Quasi-Monte Carlo (QMC) is to improve the accuracy of integrals estimated by the Monte Carlo technique through a suitable specification of the sample point set. Indeed, the errors from N samples typically drop as N−1 with QMC, which is much better than the N−1/2 dependence obtained with Monte Carlo estimates based on random point sets. The heuristic reasoning behind selecting QMC point sets is similar to that in halftoning, that is, to spread the points out as evenly as possible, consistent with the desired point density. I will outline the parallels between QMC and halftoning, and describe an halftoning-inspired algorithm for generating a sample set with uniform density, which yields smaller integration errors than standard QMC algorithms in two dimensions.
منابع مشابه
Halftoning and quasi-Monte Carlo
In performing statistical studies in simulation science, it is often necessary to estimate the value of an integral of a function that is based on a simulation calculation. Because simulations tend to be costly in terms of computer time and resources, the ability to accurately estimate integrals with a minimum number of function evaluations is a critical issue in evaluating simulation codes. Th...
متن کاملMonte Carlo forecasting from CIR square root diffusion models
We compare empirical convergence of Monte Carlo and quasi Monte Carlo estimates of the H-period forecasts using the Cox-Ingersoll-Ross square root diffusion model. The behaviour of the quasi Monte Carlo estimates in high dimensions (H = 250) using both Euler scheme and the Brownian bridge discretisation is analysed. We find that quasi Monte Carlo estimator displays much higher convergence rate ...
متن کاملAsynchronous Quasi-monte Carlo Methods
We present an asynchronous algorithm based on Quasi-Monte Carlo methods for the computation of multivari-ate integrals. Randomized Korobov and Richtmyer sequences are applied for problems of moderately high to high dimensions. We propose the use of Sobol rules in those dimensions where the integrand shows particular singular behavior. Timing results on MPI yield good speedup.
متن کاملQuasi-monte Carlo Strategies for Stochastic Optimization
In this paper we discuss the issue of solving stochastic optimization problems using sampling methods. Numerical results have shown that using variance reduction techniques from statistics can result in significant improvements over Monte Carlo sampling in terms of the number of samples needed for convergence of the optimal objective value and optimal solution to a stochastic optimization probl...
متن کاملA comparison between (quasi-)Monte Carlo and cubature rule based methods for solving high-dimensional integration problems
Algorithms for estimating the integral over hyper-rectangular regions are discussed. Solving this problem in high dimensions is usually considered a domain of Monte Carlo and quasi-Monte Carlo methods, because their power degrades little with increasing dimension. These algorithms are compared to integration routines based on interpolatory cubature rules, which are usually only used in low dime...
متن کامل